unboundedness in moilp and its efficient solutions
Authors
abstract
in this paper we investigate multi-objective integer linear programming (moilp) problems with unbounded feasible region and introduce recession direction for moilp problems. then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of moilp problems. finally we present some examples with unbounded feasible region and finite and infinite efficient solution.
similar resources
UNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS
In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...
full textSigncryption and Its Applications in Efficient Public Key Solutions
Signcryption is a new paradigm in public key cryptography that simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step, and with a cost significantly lower than that required by the traditional “signature followed by encryption” approach. This paper summarizes currently known construction methods for signcryption, carries out a compre...
full textthe survey of the virtual higher education in iran and the ways of its development and improvement
این پژوهش با هدف "بررسی وضعیت موجود آموزش عالی مجازی در ایران و راههای توسعه و ارتقای آن " و با روش توصیفی-تحلیلی و پیمایشی صورت پذیرفته است. بررسی اسنادو مدارک موجود در زمینه آموزش مجازی نشان داد تعداد دانشجویان و مقاطع تحصیلی و رشته محل های دوره های الکترونیکی چندان مطلوب نبوده و از نظر کیفی نیز وضعیت شاخص خدمات آموزشی اساتید و وضعیت شبکه اینترنت در محیط آموزش مجازی نامطلوب است.
Unboundedness of Solutions of Timoshenko Beam Equations with Damping and Forcing Terms
Timoshenko beam equations with external damping and internal damping terms and forcing terms are investigated, and boundary conditions (end conditions) to be considered are hinged ends (pinned ends), hinged-sliding ends, and sliding ends. Unboundedness of solutions of boundary value problems for Timoshenko beam equations is studied, and it is shown that the magnitude of the displacement of the ...
full textEfficient Linear Unboundedness Testing: Algorithm and Applications to Translational Assembly Planning
We address the problem of efficiently testing for linear unboundedness and its applications to translational assembly planning. We describe a new algorithm that performs the test by solving a single homogeneous system of equations followed by a single linear feasibility test. We show that testing for unboundedness is computationally at least as hard as these two subproblems. The new algorithm i...
full textPushdown Games with Unboundedness and Regular Conditions
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning conditions are Boolean combinations of a Büchi condition and a new condition that we call unboundedness. An infinite play satisfies the unboundedness condition if there is no bound on the size of the stack during the play. We sho...
full textMy Resources
Save resource for easier access later
Journal title:
international journal of mathematical modelling and computationsجلد ۱، شماره ۳ (SUMMER)، صفحات ۱۹۵-۱۹۸
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023